Database replication policies for dynamic content applications
نویسندگان
چکیده
منابع مشابه
Queue Weighting Load-Balancing Technique for Database Replication in Dynamic Content Web Sites
There is an ever increasing need for database replication in dynamic web sites to improve availability. However, the main problem in replication is load balancing. This paper presents new load balance technique to increase the performance of database replication in dynamic web depending on the type and weight of database server queue. We attempt at evaluation various load distribution policies,...
متن کاملDiffusive load-balancing policies for dynamic applications
Massively parallel architectures require decentralized and scalable system policies. The paper presents and evaluates a set of local dynamic load balancing strategies inspired by diffusion and characterized by different scopes of locality: the goal is to compare their performance depending on the application dynamicity. The paper shows that only slowly dynamic applications can take advantage of...
متن کاملScalable database replication through dynamic multiversioning
We scale the database back-end in dynamic content cluster servers by distributing read-only transactions on a set of lightweight database replicas while maintaining 1copy-serializability. This is contrary to conventional wisdom in replicated databases which says that one could have either 1-copy serializability or scalability, but not both. The key to scaling is a novel integrated fine-grained ...
متن کاملConflict-Aware Scheduling for Dynamic Content Applications
We present a new lazy replication technique, suitable for scaling the back-end database of a dynamic content site using a cluster of commodity computers. Our technique, called conflict-aware scheduling, provides both throughput scaling and 1-copy serializability. It has generally been believed that this combination is hard to achieve through replication because of the growth of the number of co...
متن کاملOptimal Redesign Policies to Support Dynamic Processing of Applications on a Distributed Relational Database System
An application processing center consists of a set of well-de ned, well-designed and well-tested applications that are dynamically executed over a period of time. We assume that there is a set of candidate distributed database designs each of which is optimal for some applications. The random execution of applications on a distributed database design is modeled as a discrete Markov process, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGOPS Operating Systems Review
سال: 2006
ISSN: 0163-5980
DOI: 10.1145/1218063.1217945